A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

Source URL: www.cse.cuhk.edu.hk

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

Source URL: www.cs.toronto.edu

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan∗ Department of EECS UC Berkeley

Source URL: www.cs.toronto.edu

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

Source URL: www.bedewell.com

• Computational complexity theory
• Logic
• Complexity classes
• Mathematical logic
• PSPACE
• FO
• Second-order logic
• P versus NP problem
• Constraint satisfaction problem
• NP
• P
• Constraint satisfaction

Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science

Source URL: www.ifor.math.ethz.ch

• Graph theory
• Mathematics
• Constraint programming
• Discrete mathematics
• Morphisms
• Constraint satisfaction problem
• Graph homomorphism
• Constraint satisfaction
• Complexity of constraint satisfaction
• Graph minor

Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

Source URL: drops.dagstuhl.de

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Constraint programming
• NP-complete problems
• Boolean algebra
• Parameterized complexity
• Boolean satisfiability problem
• Constraint satisfaction problem
• Exponential time hypothesis
• Treewidth
• Tree decomposition

Introduction & Motivation Relations and Operations The complexity of positive equality-free first-order logic

Source URL: www.bedewell.com

• Complexity classes
• Finite model theory
• Computational complexity theory
• Descriptive complexity
• FO
• Constraint programming
• Constraint satisfaction problem
• P
• Model theory
• Mathematical logic
• Constraint satisfaction
• HO

Low-level dichotomy for Quantified Constraint Satisfaction Problems Barnaby Martin 1 School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.K.

Source URL: www.bedewell.com

• Model theory
• Constraint programming
• Logical truth
• Mathematical logic
• Formal languages
• Structure
• Interpretation
• Satisfiability
• Substitution
• Constraint satisfaction problem
• Complexity of constraint satisfaction
• Boolean satisfiability problem

The complexity of satisfaction problems in Reverse Mathematics Ludovic Patey Laboratoire PPS, Université Paris Diderot, Paris, FRANCE

Source URL: ludovicpatey.com

• Logic
• Mathematics
• Constraint programming
• Abstraction
• Model theory
• Boolean satisfiability problem
• Electronic design automation
• Logic in computer science
• Complexity of constraint satisfaction
• Constraint satisfaction problem
• Satisfiability
• Binary relation

Parameterized complexity of constraint satisfaction problems ´ Daniel Marx Budapest University of Technology and Economics

Source URL: www.cs.bme.hu